On the extention of propelinear structures of Nordstrom-Robinson code to Hamming code
نویسنده
چکیده
A code is called propelinear if its automorphism group contains a subgroup that acts regularly on its codewords, which is called a propelinear structure on the code. In the paper a classification of the propelinear structures on the Nordstrom-Robinson code is obtained and the question of extension of these structures to propelinear structures of the Hamming code, that contains the Nordstrom-Robinson code. The result partially relies on a representation of all partitions of the Hamming code into codes with parameters of Nordstrom-Robinson code via Fano planes which is given in the paper.
منابع مشابه
The Nordstrom-Robinson Code is the Binary Image of 19 the Octacode
The Nordstrom-Robinson code, a nonlinear binary code of length 16 and minimal Hamming distance 6, is the binary image of the octacode, a linear self-dual code over 4 of length 8 and minimal Lee distance 6. Since the octacode is the 4-analogue of a Hamming code, this provides an extremely simple definition of the Nordstrom-Robinson code. A different version of this paper appeared in: Coding and ...
متن کاملOn the Number of Nonequivalent Propelinear Extended Perfect Codes
The paper proves that there exists an exponential number of nonequivalent propelinear extended perfect binary codes of length growing to infinity. Specifically, it is proved that all transitive extended perfect binary codes found by Potapov (2007) are propelinear. All such codes have small rank, which is one more than the rank of the extended Hamming code of the same length. We investigate the ...
متن کاملA linear construction for certain Kerdock and Preparata codes
The Nordstrom-Robinson, Kerdock and (slightly modified) Preparata codes are shown to be linear over 4, the integers mod 4. The Kerdock and Preparata codes are duals over 4, and the Nordstrom-Robinson code is self-dual. All these codes are just extended cyclic codes over 4. This provides a simple definition for these codes, and explains why their Hamming weight distributions are dual to each oth...
متن کاملPropelinear structure of Z_{2k}-linear codes
Let C be an additive subgroup of Z n 2k for any k ≥ 1. We define a Gray map Φ : Z n 2k −→ Z kn 2 such that Φ(C) is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover, Φ is the unique Gray map such that Φ(C) is Hamming-compatible group code. Using this Gray map we discuss about the nonexistence of 1-perfect binary mixed group code.
متن کاملModular and p-adic Cyclic Codes
This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo pa and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic cyclic code of length 7 with generator polynomial X 3 + ,~X 2 + (L I)X -l, where )~ satisfies ~2 _ k + 2 = 0. This is the 2-adic generalization of both the bina...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1512.03245 شماره
صفحات -
تاریخ انتشار 2015